Representations: The Hard Problem for Artificial Life
نویسنده
چکیده
Representationalism, the original driving theory behind artificial intelligence and cognitive science, has fallen upon hard times. Representationalism identifies cognitive processes with the manipulation of explicit symbolic structures according to well-defined rules. Rocha and Hordijk put forward three requirements for something to qualify as a representation: dynamically incoherent memory, construction code, and self-organization; they also forsake the traditional idea of representation as a “standing-in” relationship between a representation and its content. While we note that Rocha and Hordijk’s three requirements are an improvement over the definition of representation as a style of explanation, we argue that this “standing-in” relationship is the defining characteristic of representations. We define representations as physically implemented structures that can create local effects that are effective by virtue of their correspondence with non-local parts of the world, and argue that this definition, while being perfectly natural, does present a difficult, although not insurmountable, challenge for artificial life.
منابع مشابه
A Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version
Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...
متن کاملHybrid artificial immune system and simulated annealing algorithms for solving hybrid JIT flow shop with parallel batches and machine eligibility
This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...
متن کاملMILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags
In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...
متن کاملAn Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملPredictions of Tool Wear in Hard Turning of AISI4140 Steel through Artificial Neural Network, Fuzzy Logic and Regression Models
The tool wear is an unavoidable phenomenon when using coated carbide tools during hard turning of hardened steels. This work focuses on the prediction of tool wear using regression analysis and artificial neural network (ANN).The work piece taken into consideration is AISI4140 steel hardened to 47 HRC. The models are developed from the results of experiments, which are carried out based on De...
متن کامل